Optimizing the eigenvector computation algorithm with diffusion approach
نویسندگان
چکیده
In this paper, we apply the ideas of the matrix column based diffusion approach to define a new eigenvector computation algorithm of a stationary probability of a Markov chain.
منابع مشابه
D-Iteration: diffusion approach for solving PageRank
In this paper we present a new method that can accelerate the computation of the eigenvector of the transition matrix associated to the PageRank algorithm. Our method, called D-Iteration, is based on the decomposition of the matrix-vector product that can be seen as a fluid diffusion model and is potentially adapted to asynchronous implementation. We also make a comparison with OPIC (Online Pag...
متن کاملOptimized on-line computation of PageRank algorithm
In this paper we present new ideas to accelerate the computation of the eigenvector of the transition matrix associated to the PageRank algorithm. New ideas are based on the decomposition of the matrix-vector product that can be seen as a fluid diffusion model, associated to new algebraic equations. We show through experimentations on synthetic data and on real data-sets how much this approach ...
متن کاملRegularized Laplacian Estimation and Fast Eigenvector Approximation
Recently, Mahoney and Orecchia demonstrated that popular diffusion-based procedures to compute a quick approximation to the first nontrivial eigenvector of a data graph Laplacian exactly solve certain regularized Semi-Definite Programs (SDPs). In this paper, we extend that result by providing a statistical interpretation of their approximation procedure. Our interpretation will be analogous to ...
متن کاملاستفاده از الگوریتم ژنتیک در مسائل کوتاهترین مسیر چند معیاره بر پایه سیستمهای اطلاعات مکانی
Multi-criteria shortest path problems (MSPP) are called as NP-Hard. For MSPPs, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. Algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. This paper describes the development ...
متن کاملFree-Spin Tracking: A Novel Global Tractography Algorithm
Diffusion MRI [1] and fiber tractography have become a reference to study the neural structure of the brain white matter. Standard tractography algorithms behave generally locally, i.e., a single fiber is initiated at a seed point and is constructed iteratively, thus making fibers subject to cumulative errors. On the contrary, in global approaches the entire white matter is tracked at once: in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1206.3177 شماره
صفحات -
تاریخ انتشار 2012